منابع مشابه
A Proof Theory for Model Checking: An Extended Abstract
While model checking has often been considered as a practical alternative to building formal proofs, we argue here that the theory of sequent calculus proofs can be used to provide an appealing foundation for model checking. Since the emphasis of model checking is on establishing the truth of a property in a model, we rely on the proof theoretic notion of additive inference rules, since such ru...
متن کاملProof Assisted Model Checking for B
With the aid of the ProB Plugin, the Rodin Platform provides an integrated environment for editing, proving, animating and model checking Event-B models. This is of considerable benefit to the modeler, as it allows him to switch between the various tools to validate, debug and improve his or her models. The crucial idea of this paper is that the integrated platform also provides benefits to the...
متن کاملFrom Model Checking to a Temporal Proof for Partial Models
This paper describes in detail the example introduced in the preliminary evaluation of THRIVE. Specifically, it evaluates THRIVE over an abstraction of the ground model proposed for a critical component belonging to a medical device used by optometrists and ophtalmologits to dected visual problems. We provide the full description of the example introduced in the preliminary evaluation of [2]. S...
متن کاملSCTL: Towards Combining Model Checking and Proof Checking
Model checking and automated theorem proving are two pillars of formal methods. This paper investigates model checking from an automated theorem proving perspective, aiming at combining the expressiveness of automated theorem proving and the complete automaticity of model checking. The focus of this paper is on the verification of the temporal logic properties of Kripke models. The properties a...
متن کاملAn Integration of Model Checking with Automated Proof Checking
Although automated proof checking tools for general-purpose logics have been successfully employed in the veriication of digital systems, there are inherent limits to the eecient automation of expressive logics. If the expressiveness is constrained, there are useful logic fragments for which eecient decision procedures can be found. The model checking paradigm yields an important class of decis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2018
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-018-9475-3